Best response adaptation under dominance solvability
نویسنده
چکیده
Two new properties of a finite strategic game, strong and weak BR-dominance solvability, are introduced. The first property holds, e.g., if the game is strongly dominance solvable or if it is weakly dominance solvable and all best responses are unique. It ensures that every simultaneous best response adjustment path, as well as every non-discriminatory individual best response improvement path, reaches a Nash equilibrium in a finite number of steps. The second property holds, e.g., if the game is weakly dominance solvable; it ensures that every strategy profile can be connected to a Nash equilibrium with a simultaneous best response path and with an individual best response path (if there are more than two players, unmotivated switches from one best response to another may be needed). In a two person game, weak BR-dominance solvability is necessary for the acyclicity of simultaneous best response adjustment paths, as well as for the acyclicity of best response improvement paths provided the set of Nash equilibria is rectangular. Journal of Economic Literature Classification Number: C 72.
منابع مشابه
Cournot tâtonnement and dominance solvability in finite games
If a finite strategic game is strictly dominance solvable, then every simultaneous best response adjustment path, as well as every non-discriminatory individual best response improvement path, ends at a Nash equilibrium after a finite number of steps. If a game is weakly dominance solvable, then every strategy profile can be connected to a Nash equilibrium with a simultaneous best response path...
متن کاملScoring rule voting games and dominance solvability
This paper studies the dominance-solvability (by iterated deletion of weakly dominated strategies) of general scoring rule voting games. The scoring rules we study include Plurality rule, Approval voting, Negative Plurality Rule, Borda rule and Relative Utilitarianism. We provide a classification of scoring rule voting games according to whether the sufficient conditions for dominance solvabili...
متن کاملThe Borda Count and Dominance Solvable Voting Games
We analyse dominance solvability (by iterated elimination of weakly dominated strategies) of voting games with three candidates and provide sufficient and necessary conditions for the Borda Count to yield a unique winner. We find that Borda is the unique scoring rule that is dominance solvable both (i) under unanimous agreement on a best candidate and (ii) under unanimous agreement on a worst c...
متن کاملA fixed point characterization of the dominance-solvability of lattice games with strategic substitutes
This note demonstrates that a lattice game with strategic substitutes is dominancesolvable if and only if there exists a unique fixed point of the function that results from an iteration of the best response function. This finding complements a result of Milgrom and Roberts’ (1990) by which a lattice game with strategic complements is dominance-solvable if and only if there exists a unique Nash...
متن کاملCharacterizing stability properties in games with strategic substitutes
In games with strategic substitutes (GSS), convergence of the best response dynamic starting from the inf (or sup) of the strategy space is equivalent to global stability (convergence of every adaptive dynamic to the same pure strategy Nash equilibrium). Consequently, in GSS, global stability can be analyzed using a single best response dynamic. Moreover, in GSS, global stability is equivalent ...
متن کامل